Fast Bypass Algorithms for High-Speed Networks
نویسندگان
چکیده
In this work we suggest algorithms that increase the reservation success probability for bursty traac in high speed networks by adding exibility to the construction of the routes. These algorithms are simple enough to be implemented by cheap hardware. They cause no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the presented algorithms have a minimal communication overhead, due to the local nature of their work. Two high-speed network models were considered: source routing and ATM.
منابع مشابه
Application Mapping onto Network-on-Chip using Bypass Channel
Increasing the number of cores integrated on a chip and the problems of system on chips caused to emerge networks on chips. NoCs have features such as scalability and high performance. NoCs architecture provides communication infrastructure and in this way, the blocks were produced that their communication with each other made NoC. Due to increasing number of cores, the placement of the cores i...
متن کاملRouting Improvement for Vehicular Ad Hoc Networks (VANETs) Using Nature Inspired Algorithms
are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...
متن کاملVery Fast Load Flow Calculation Using Fast-Decoupled Reactive Power Compensation Method for Radial Active Distribution Networks in Smart Grid Environment Based on Zooming Algorithm
Distribution load flow (DLF) calculation is one of the most important tools in distribution networks. DLF tools must be able to perform fast calculations in real-time studies at the presence of distributed generators (DGs) in a smart grid environment even in conditions of change in the network topology. In this paper, a new method for DLF in radial active distribution networks is proposed. The ...
متن کاملA Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty traac in high speed networks by adding exibility to the construction of the routes. The algorithm is simple enough to be implemented by cheap hardware. It causes no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the pr...
متن کاملA HYBRID CHARGED SYSTEM SEARCH - FIREFLY ALGORITHM FOR OPTIMIZATION OF WATER DISTRIBUTION NETWORKS
Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a...
متن کامل